Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced in this paper. Our bounds improve the previous ones in almost all cases.     

Improving retrieval accuracy of Hierarchical Cellular Trees for generic metric spaces

Metric Access Methods (MAMs) are indexing techniques which allow working in generic metric spaces. Therefore, MAMs are specially useful for Content-Based Image Retrieval systems based on features which use non L _p norms as similarity measures. MAMs naturally allow the design of image browsers due to their inherent hierarchical structure. The Hierarchical Cellular Tree (HCT), a MAM-based indexing technique, provides the starting point of our work. In this paper, we describe some limitations detected in the original formulation of the HCT and propose some modifications to both the index building and the search algorithm. First, the covering radius, which is defined as the distance from the representative to the furthest element in a node, may not cover all the elements belonging to the node’s subtree. Therefore, we propose to redefine the covering radius as the distance from the representative to the furthest element in the node’s subtree. This new definition is essential to guarantee a correct construction of the HCT. Second, the proposed Progressive Query retrieval scheme can be redesigned to perform the nearest neighbor operation in a more efficient way. We propose a new retrieval scheme which takes advantage of the benefits of the search algorithm used in the index building. Furthermore, while the evaluation of the HCT in the original work was only subjective, we propose an objective evaluation based on two aspects which are crucial in any approximate search algorithm: the retrieval time and the retrieval accuracy. Finally, we illustrate the usefulness of the proposal by presenting some actual applications.     

On the hardness of solving edge matching puzzles as SAT or CSP problems

Edge matching puzzles have been amongst us for a long time now and traditionally they have been considered, both, a children’s game and an interesting mathematical divertimento. Their main characteristics have already been studied, and their worst-case complexity has been properly classified as a NP-complete problem. It is in recent times, specially after being used as the problem behind a money-prized contest, with a prize of 2US$ million for the first solver, that edge matching puzzles have attracted mainstream attention from wider audiences, including, of course, computer science people working on solving hard problems. We consider these competitions as an interesting opportunity to showcase SAT/CSP solving techniques when confronted to a real world problem to a broad audience, a part of the intrinsic, i.e. monetary, interest of such a contest. This article studies the NP-complete problem known as edge matching puzzle using SAT and CSP approaches for solving it. We will focus on providing, first and foremost, a theoretical framework, including a generalized definition of the problem. We will design and show algorithms for easy and fast problem instances generation, generators with easily tunable hardness. Afterwards we will provide with SAT and CSP models for the problems and we will study problem complexity, both typical case and worst-case complexity. We will also provide some specially crafted heuristics that result in a boost in solving time and study which is the effect of such heuristics.     

DipGame: A challenging negotiation testbed

There is a chronic lack of shared application domains to test advanced research models and agent negotiation architectures in Multiagent Systems. In this paper we introduce a friendly testbed for that purpose. The testbed is based on The Diplomacy Game where negotiation and the relationships between players play an essential role. The testbed profits from the existence of a large community of human players that know the game and can easily provide data for experiments. We explain the infrastructure in the paper and make it freely available to the AI community.     

Agent-Mediated Electronic Commerce

Electronic commerce has been one of the traditional arenas for agent technology. The complexity of these applications has been a challenge for researchers that have developed methodologies, products, and systems, having in mind the specificities of trade, the interaction particularities of commerce, the strict notion of commitment and contract, and the clearly shaped conventions and norms that structure the field. In this paper I survey some key areas for agent technology which, although general, are of special importance in electronic commerce, namely, solid development methodologies, negotiation technologies and trust-building mechanisms. I give examples of systems in which I have directly participated, although I also try to refer to the work of other AgentLink Special Interest Group members over the last few years.     

Electrode surface treatments in sludge electro-osmosis dewatering

The sewage sludge dewatering produced by wastewater treatment plants (WWTP) is a multifaceted process due to the presence of colloid fractions. Electro-osmosis could be a suitable technique to reduce the water content of the final sludge. Electric fields of 10, 15, and 20?V/cm have been studied for electro-osmosis tests under the pressure of a static or rotating piston, obtaining a dry solids content up to 40–45%, with respect to 25–30% obtained by mechanical methods. In order to optimize the process, the corrosion behavior and the wear of the anodic material appear to be the main critical aspects, due to the high circulating current density and the use of a rotating electrode. We compared the efficiency and the corrosion resistance of dimensionally stable anodes (DSA) with respect to bare stainless steel (AISI 304) and stainless steel coated by PVD technique with TiN, AlTiN, and DLC. Characterization of the anode surfaces by SEM and potentiodynamic tests show that DSA is the most suitable material for our application. However, efficiencies of the electro-osmosis processes have been found comparable, in terms of developed current densities and total energy consumptions, for short-test duration.     

Simflowny: A general-purpose platform for the management of physical models and simulation problems

Simflowny is a software platform which aims to formalize the main elements of a simulation flow. It allows users to manage (i) formal representations of physical models based on Initial Value Problems (hyperbolic, parabolic and mixed-type partial differential equations), (ii) simulation problems based on such models, and (iii) discretization schemes to translate the problem to a finite mesh. Additionally, Simflowny generates automatically code for general-purpose simulation frameworks. This paper first presents an introductory example of such problems. Then, formal representations are explained. Afterwards, it summarizes the platform’s architecture. Finally, validation results are provided.     

Distributed parameter model simulation tool for PEM fuel cells

In this work, a simulation tool for proton exchange membrane fuel cells (PEMFC) has been developed, based on a distributed parameter model. The tool is designed to perform studies of time and space variations in the direction of the gas channels. Results for steady-state and dynamic simulations for a single cell of one channel are presented and analyzed. Considered variables are concentrations of reactants, pressures, temperatures, humidification, membrane water content, current density, among others that have significant effects on the performance and durability of PEMFC.